NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
751	Clique Problem, Cutting Plane Proofs and Communication Complexity✩ Stasys Jukna Institute of Computer Science, University of Frankfurt, Frankfurt a.M., Germany Institute of Mathematics and Informatics, Vilnius Universi Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2012-06-27 11:58:26 NP-complete problems Clique Matching Maximal independent set Independent set Circuit complexity Path decomposition Bipartite dimension Graph theory Theoretical computer science Mathematics
752	Limitations of Incremental Dynamic Programming Stasys Jukna Abstract We consider so-called “incremental” dynamic programming algorithms, and are interested in the number of subproblems produced by them. The classical Add to Reading List Source URL: lovelace.thi.informatik.uni-frankfurt.de Language: English - Date: 2013-04-23 13:36:27 Operations research Dynamic programming NP-complete problems Mathematical optimization Combinatorics Algorithm Greedy algorithm Knapsack problem Longest increasing subsequence Mathematics Theoretical computer science Applied mathematics
753	Pick 3 or Pickanother NP–complete 3-Dimensional Matching Variant Marzio De Biasi marziodebiasi [at] gmail [dot] com July 2014 Add to Reading List Source URL: www.nearly42.org Language: English - Date: 2014-07-31 19:07:02 Matching 3-dimensional matching Combinatorics Exact cover Numerical 3-dimensional matching Mathematics NP-complete problems Applied mathematics
754	A note on sampling scale-free graphs K. M. Briggs BT Research, Adastral Park Martlesham UK IP5 3RE 2007 November 19 16:47 In Proc. Nat. Acad. Sci. 102, ), Stumpf et al. have shown Add to Reading List Source URL: keithbriggs.info Language: English - Date: 2008-01-02 07:43:53 Analytic number theory Meromorphic functions Degree distribution Scale-free network Riemann zeta function Degree Random graphs NP-complete problems Dominating set Graph theory Mathematics Mathematical analysis
755	COMS21103 NP-completeness (or how to prove that problems are probably hard) Ashley Montanaro Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:08 Complexity classes Analysis of algorithms Mathematical optimization Time complexity Algorithm P NP-complete P versus NP problem Quantum algorithm Theoretical computer science Computational complexity theory Applied mathematics
756	arXiv:1304.7456v1 [cs.DS] 28 AprCounting Hypergraphs in Data Streams He Sun Max Planck Institute for Informatics Saarbr¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2013-05-03 12:26:04 Hypergraph NP-complete problems Graph Packing in a hypergraph Orbifold Graph theory Theoretical computer science Mathematics
757	Crawling Deep Web Using a New Set Covering Algorithm Yan Wang1 , Jianguo Lu12 , and Jessica Chen1 1 2 Add to Reading List Source URL: jlu.myweb.cs.uwindsor.ca Language: English - Date: 2009-10-20 21:31:39 NP-complete problems Greedy algorithm Matroid theory Information retrieval Algorithm Invisible Web Set cover problem Mathematics Combinatorics Applied mathematics
758	On-Core Software, LLC. 893 Sycamore Ave Tinton Falls, NJUnited States of America Website: http://www.on-core.com Technical Support: Add to Reading List Source URL: www.on-core.com Language: English - Date: 2014-02-05 23:23:46 Logic puzzles Recreational mathematics Games NP-complete problems Sudokuro Mathematics of Sudoku Mathematics Puzzle video games Sudoku
759	Approximate Computation and Implicit Regularization for Very Large-scale Data Analysis Michael W. Mahoney Department of Mathematics Stanford University Stanford, CA 94305 Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2012-05-21 20:27:46 Linear algebra NP-complete problems Matrix theory Computational complexity theory Graph partition Approximation algorithm Algorithm Graph theory Eigenvalues and eigenvectors Mathematics Algebra Theoretical computer science
760	Extreme Sudoku solving with Ruby Matt Westcott Why a sudoku solver? Add to Reading List Source URL: matt.west.co.tt Language: English Recreational mathematics NP-complete problems Logic puzzles Sudoku Ruby Lookahead Iterator Sudoku algorithms Computing Software engineering Mathematics

UPDATE